General gate array routing using a k-terminal net routing algorithm with failure prediction

In this paper a general approach to gate array routing is presented, based on an abstract routing space model. An efficient k–terminal net maze runner is described. It does not partition nets into 2–terminal net routing problems, but solves the problem by simultaneously growing k search waves. It is shown that the explored routing space diminishes when compared to bi–directional routing schemes. Additional routing space restriction is attained by use of variable search space restriction and due to the introduction of a dynamic routing space partitioning method based on the concept of regions. This concept allows us to determine non routable nets or parts of nets in an efficient way. Is is shown that this new partitioning method may be implemented in any maze runner without increasing the complexity of the maze runner algorithm. Result show a decreas of cpu–time up to 35%. Especially in congested routing space the cpu–time decreases significantly.